Experiments on Combinatorial Auctions

This paper contains the description of experiments done so far in the combinatorial auction scenario. We describe the computee side and the society side. In this context we introduce also external objects providing services to the computees themselves, and in particular implementing a complex optimization algorithm. Experimental results are given for a traditional combinatorial auction and for two variants of it: a double auction and an auction plus the successive payment with Netbill. Copyright c © 2005 by the SOCS Consortium. The SOCS Consortium consists of the following partners: Imperial College of Science, Technology and Medicine, University of Pisa, City University, University of Cyprus, University of Bologna, University of Ferrara. Experiments on Combinatorial Auctions M. Alberti, F Chesani, U. Endriss, M. Gavanelli, A. Guerri, E. Lamma, W. Lu, P. Mello, M. Milano, K. Stathis, F. Toni, P. Torroni UNIBO, DIFERRARA, CITY, ICSTM ABSTRACT This paper contains the description of experiments done so far in the combinatorial auction scenario. We describe the computee side and the society side. In this context we introduce also external objects providing services to the computees themselves, and in particular implementing a complex optimization algorithm. Experimental results are given for a traditional combinatorial auction and for two variants of it: a double auction and an auction plus the successive payment with Netbill.This paper contains the description of experiments done so far in the combinatorial auction scenario. We describe the computee side and the society side. In this context we introduce also external objects providing services to the computees themselves, and in particular implementing a complex optimization algorithm. Experimental results are given for a traditional combinatorial auction and for two variants of it: a double auction and an auction plus the successive payment with Netbill.